Projection and contraction methods for semidefinite programming 解半定规划的投影收缩法
semidefinite programming is an extension of linear programming 半定规划是线性规划的一种推广
A cut-plane algorithm for semidefinite programming and its application 半定规划的割平面算法及其应用
Lagrange duality and saddle points theorem for multiobjective semidefinite programming 对偶与鞍点定理
A new filter algorithm and its convergence of semidefinite programming 半定规划问题的筛选算法及其收敛性
The weighted central path method for multiobjective semidefinite programming 多目标半定规划的加权中心路径法
Firstly, based on the s-subdifferential theory and strong duality of semidefinite programming, we propose one method to solve semidefinite programming 首先,本文提出一种求解半定规划的占-次微分向量丛方法。
Firstly, based on the s-subdifferential theory and strong duality of semidefinite programming, we propose one method to solve semidefinite programming 首先,本文提出一种求解半定规划的占-次微分向量丛方法。
In this method, we get the optimal value of semidefinite programming by finding the optimal descent direction of its dual problem 该方法根据次微分理论与半定规划的强对偶定理,通过求解对偶问题得到原始问题的最优值。
2 . a new kind of algorithm, based on the golden section method for semidefinite programming is presented, which makes full use of the structure of the feasiable region 这种算法是通过用黄金分割法在切割面上求优迭代求解的,具有简便、计算量小的特点